Formal Analysis of a Receipt-Free Auction Protocol in Applied Pi
نویسندگان
چکیده
We formally study two privacy-type properties for e-auction protocols: bidding-price-secrecy and receipt-freeness. These properties are formalised as observational equivalences in the applied pi calculus. We analyse the receipt-free auction protocol by Abe and Suzuki. Bidding-price-secrecy of the protocol is verified using the automatic verifier ProVerif, whereas receipt-freeness of the protocol is proved manually.
منابع مشابه
Analysis of a Receipt-Free Auction Protocol in the Applied Pi Calculus
We formally study two privacy-type properties in online auction protocols, bidding-price-secrecy and receipt-freeness. These properties are formalised as observational equivalences in the applied π calculus. We analyse the receipt-free auction protocol by Abe and Suzuki. Bidding-price-secrecy of the protocol is verified using ProVerif, whereas receipt-freeness of the protocol is proved manually.
متن کاملSecure Receipt-Free Sealed-Bid Electronic Auction
The auction scheme that provides receipt-freeness, prevents the bidders from bid-rigging by the coercers. Bid-rigging is a dangerous attack in electronic auction. This happen if the bidder gets a receipt of his bidding price, which proves his bidding prices, from the auction protocol. The coercers used to force the bidders to disclose their receipts and hence bidders lose the secrecy of their b...
متن کاملAnalysis of Receipt-freeness in the Internet Voting Protocol with Applied Pi Calculus
The practical Internet voting protocols should have: privacy, completeness, soundness, unreusability, fairness, eligibility, and invariableness, universal verifiability, receipt-freeness, and coercion-resistance. Privacy describes the fact that a particular vote in a particular way is not revealed to anyone. Receipt-freeness means that the voter can not produce a receipt to prove that he votes ...
متن کاملDesign and Analysis of a Practical E-Voting Protocol
In this paper we design an e-voting protocol for an academic voting system which should be independent from other university applications. We briefly discuss security requirements for e-voting schemes focusing on our proposed scheme. We design a receipt-free e-voting protocol which requires neither anonymous channel nor other physical assumptions. We give a short survey on formal analysis of e-...
متن کاملAutomatic Verification of Security Properties in Remote Internet Voting Protocol with Applied Pi Calculus
Soundness and coercion resistance are the important and intricate security requirements for remote voting protocols. Several formal models of soundness and coercion-resistance have been proposed in the literatures, but these formal models are not supported by automatic tools. Recently Backes et al. propose a new formal automated model of security properties including soundness and coercionresis...
متن کامل